Generic pairs of SU-rank 1 structures
نویسندگان
چکیده
منابع مشابه
Rank error-correcting pairs
Error-correcting pairs were introduced independently by Pellikaan and Kötter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise product, some of which preserve symbolic products of linearize...
متن کاملStructures of Su-rank Omega with a Dense Independent Subset of Generics
Extending the work done in [5, 9] in the o-minimal and geometric settings, we study expansions of models of a supersimple theory of SU-rank ω with a "dense codense" independent collection H of elements of SU-rank ω, where density of H means it intersects any de nable set of SU-rank omega. We show that under some technical conditions, the class of such structures is rst order. We prove that the ...
متن کاملGeneric Structures ∗
In this paper, the theory of generic structures is put in a general, unified framework. The framework is applied to Hrushovski’s [8] universal domains and Poizat’s [11] bicoloured fields. Of particular interest will be the conditions under which generic structures are saturated.
متن کاملCosmogony of Generic Structures
The problem of formation of generic structures in the Universe is addressed, whereby rst the kinematics of inertial continua for coherent initial data is considered. The generalization to self{gravitating continua is outlined focused on the classiication problem of singularities and metamorphoses arising in the density eld. Self{gravity gives rise to an internal hierarchy of structures, and, dr...
متن کاملNonexistence of minimal pairs for generic computability
A generic computation of a subset A of N consists of a computation that correctly computes most of the bits of A, and never incorrectly computes any bits of A, but which does not necessarily give an answer for every input. The motivation for this concept comes from group theory and complexity theory, but the purely recursion theoretic analysis proves to be interesting, and often counterintuitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2003
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(02)00060-x